Dual weak pigeonhole principle, Boolean complexity, and derandomization
نویسندگان
چکیده
منابع مشابه
Dual weak pigeonhole principle, Boolean complexity, and derandomization
We study the extension (introduced as BT in [5]) of the theory S 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x2 . We propose a natural framework for formalization of randomized algorithms in bounded arithmetic, and use it to provide a strengthening of Wilkie’s witnessing theorem for S 2+dWPHP(PV ). We construct a propositional proof system WF (bas...
متن کاملResolution and the Weak Pigeonhole Principle
We give new upper bounds for resolution proofs of the weak pigeonhole principle. We also give lower bounds for tree-like resolution proofs. We present a normal form for resolution proofs of pigeonhole principles based on a new monotone resolution rule.
متن کاملDegree complexity for a modified pigeonhole principle
We consider a modiication of the pigeonhole principle, MPHP, introduced by Goerdt in 7]. Using a technique of Razborov 9] and simpliied by Impagliazzo, Pudll ak and Sgall 8], we prove that any Polynomial Calculus refutation of a set of polynomials encoding the MPHP, requires degree (log n). We also prove that the this lower bound is tight, giving Polynomial Calculus refutations of MPHP of optim...
متن کاملP != NP, propositional proof complexity, and resolution lower bounds for the weak pigeonhole principle
Recent results established exponential lower bounds for the length of any Resolution proof for the weak pigeonhole principle. More formally, it was proved that any Resolution proof for the weak pigeonhole principle, with n holes and any number of pigeons, is of length fl(2 ), (for a constant e = 1/3). One corollary is that certain propositional formulations of the statement P / NP do not have s...
متن کامل$P \ne NP$, propositional proof complexity, and resolution lower bounds for the weak pigeonhole principle
Recent results established exponential lower bounds for the length of any Resolution proof for the weak pigeonhole principle. More formally, it was proved that any Resolution proof for the weak pigeonhole principle, with n holes and any number of pigeons, is of length Ω(2n ǫ ), (for a constant ǫ = 1/3). One corollary is that certain propositional formulations of the statement P 6= NP do not hav...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2004
ISSN: 0168-0072
DOI: 10.1016/j.apal.2003.12.003